Joint Source-channel Decoding of Entropy Coded Markov Sources over Binary Symmetric Channels
نویسندگان
چکیده
This paper proposes an optimal joint source-channel, maximum a posteriori, decoder for entropy coded Markov sources transmitted over noisy channels. We introduce the concept of incomplete and complete states to deal with the problem of variable length source codes in the decoder. The proposed decoder is sequential, there by making the expected delay finite. When compared to the standard Huffman decoder, the proposed decoder shows a maximum improvement, of about 4dB in a modified signal to noise ratio and an improvement of 21:95% in percentage of bits that are received in an out of synchronization condition, for a simple test source.
منابع مشابه
An Integrated Joint Source-Channel Decoder for MPEG-4 Coded Video
The MPEG-4 video coding standard uses variable length codes (VLCs) to encode the indices of intra and inter macroblocks after discrete cosine transform and quantization. Although VLCs can achieve good compression, they are very sensitive to channel errors. Joint source-channel decoding (JSCD) is emerging as an efficient method for dealing with this sensitivity to channel errors. This paper prop...
متن کاملDistributed Source-Channel Coding Using Reduced-Complexity Syndrome-Based TTCM
In the context of Distributed Joint Source-Channel coding (DJSC), we conceive reduced-complexity Turbo Trellis Coded Modulation (TTCM)-aided syndrome-based block decoding for estimating the crossover probability pe of the Binary Symmetric Channel (BSC), which models the correlation between a pair of sources. Our joint decoder achieves an accurate correlation estimation for varying correlation c...
متن کاملA Practical Approach to Lossy Joint Source-Channel Coding
This work is devoted to practical joint source channel coding. Although the proposed approach has more general scope, for the sake of clarity we focus on a specific application example, namely, the transmission of digital images over noisy binary-input output-symmetric channels. The basic building blocks of most stateof the art source coders are: 1) a linear transformation; 2) scalar quantizati...
متن کاملLinear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory
Linear programming (LP) decoding of low-density parity-check codes was introduced by Feldman et al. in [1]. In his formulation it is assumed that communication takes place over a memoryless channel and that the source is uniform. Here, we extend the LP decoding paradigm by studying its application to scenarios with source nonuniformity and to decoding over channels with memory. We develop two d...
متن کاملReduced Complexity Joint Source-channel Turbo Decoding of Entropy Coded Sources
In [6], we presented a new joint source channel turbo decoding algorithm for entropy coded sources. The algorithm was based on a Bayesian network representation of the coding chain, and incorporates three types of redundancies, namely the source memory, the residual redundancy of the source coder and the artificial redundancy introduced by the channel coder. The algorithm was shown to yield sev...
متن کامل